Tight Upper Bounds for Cell Loss Probabilities in ATM Multiplexersand Required
نویسندگان
چکیده
Estimating the cell loss probability in an ATM multi-plexer is a key issue in network management and traac control such as call admission control and bandwidth allocation. In this paper, we derive a new approximation to estimate the total and individual cell loss probabilities in an ATM multiplexer fed by a superposition of heterogeneous on-oo sources with exponentially distributed on and oo periods. Based on this approximation, a simple and accurate method is proposed to estimate the aggregate required bandwidth by a given mix of traac to guarantee a given cell loss probability.
منابع مشابه
Tight Upper Bounds for Cell Loss Probabilities in ATM Multiplexers and Required Bandwidth Estimation
Estimating the cell loss probability in an ATM multi plexer is a key issue in network management and tra c control such as call admission control and bandwidth al location In this paper we derive a new approximation to estimate the total and individual cell loss probabilities in an ATM multiplexer fed by a superposition of hetero geneous on o sources with exponentially distributed on and o peri...
متن کاملTight Upper Bounds for Cell Loss Probabilities in ATM
Estimating the cell loss probability in an ATM multi-plexer is a key issue in network management and traac control such as call admission control and bandwidth allocation. In this paper, we derive a new approximation to estimate the total and individual cell loss probabilities in an ATM multiplexer fed by a superposition of heterogeneous on-oo sources with exponentially distributed on and oo pe...
متن کاملTight upper bounds for cell loss probabilitiesand required bandwidth estimation in
Estimating the cell loss probability in an ATM multiplexer is a key issue in network management and traac control tasks such as call admission control and bandwidth allocation. In this paper, we derive a new approximation to estimate the total and individual cell loss probabilities in an ATM multiplexer fed by a superposition of heterogeneous on-oo sources. Based on this approximation, a simple...
متن کاملM1, M2, ..., Mk/G1, G2,..., Gk/l/N Queue with Buffer Division and Push-Out Schemes for ATM Networks (RESEARCH NOTE)
In this paper, loss probabilities and steady state probabilities of data packets for an asynchronous transfer mode (ATM) network are investigated under the buffer division and push-out schemes. Data packets are classified in classes k which arrive in Poisson fashion to the service facility and are served with general service rate under buffer division scheme, finite buffer space N is divided in...
متن کاملExact maximum coverage probabilities of confidence intervals with increasing bounds for Poisson distribution mean
A Poisson distribution is well used as a standard model for analyzing count data. So the Poisson distribution parameter estimation is widely applied in practice. Providing accurate confidence intervals for the discrete distribution parameters is very difficult. So far, many asymptotic confidence intervals for the mean of Poisson distribution is provided. It is known that the coverag...
متن کامل